12 research outputs found

    Optimal Resource Allocation for Multi-user OFDMA-URLLC MEC Systems

    Full text link
    In this paper, we study resource allocation algorithm design for multi-user orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) in mobile edge computing (MEC) systems. To meet the stringent end-to-end delay and reliability requirements of URLLC MEC systems, we propose joint uplink-downlink resource allocation and finite blocklength transmission. Furthermore, we employ a partial time overlap between the uplink and downlink frames to minimize the end-to-end delay, which introduces a new time causality constraint. The proposed resource allocation algorithm is formulated as an optimization problem for minimization of the total weighted power consumption of the network under a constraint on the number of URLLC user bits computed within the maximum allowable computation time, i.e., the end-to-end delay of a computation task. Despite the non-convexity of the formulated optimization problem, we develop a globally optimal solution using a branch-and-bound approach based on discrete monotonic optimization theory. The branch-and-bound algorithm minimizes an upper bound on the total power consumption until convergence to the globally optimal value. Furthermore, to strike a balance between computational complexity and performance, we propose two efficient suboptimal algorithms based on successive convex approximation and second-order cone techniques. Our simulation results reveal that the proposed resource allocation algorithm design facilitates URLLC in MEC systems, and yields significant power savings compared to three baseline schemes. Moreover, our simulation results show that the proposed suboptimal algorithms offer different trade-offs between performance and complexity and attain a close-to-optimal performance at comparatively low complexity.Comment: 32 pages, 9 figures, submitted for an IEEE journal. arXiv admin note: substantial text overlap with arXiv:2005.0470

    Resource Allocation for Multi-User Downlink MISO OFDMA-URLLC Systems

    No full text

    Wheat drought-tolerance to enhance food security in Tunisia, birthplace of the Arab Spring

    No full text
    The beginning of the ‘Arab Spring’ in 2011, a regional revolution which started in the Tunisian city of Sidi Bouzid in late 2010, occurred in part as a result of drought-triggered high wheat prices, which in the past led to ‘bread riots’ across several Middle East and North Africa (MENA) nations. Here we present, for the first time, an analysis of possible amelioration of wheat yield loss and greater stability in bread supply resulting from the incorporation of putative drought-tolerant traits into wheat cultivars grown in Tunisia. To this end, we used a simulation crop modeling approach using SSM-Wheat to evaluate yield loss or gain resulting from three types of water-saving traits that have been recently identified in wheat. These consisted in partial stomatal closure at high soil water content, overall decrease in transpiration rate (TR), and partial stomatal closure under elevated vapor pressure deficit (VPD). To capture large gradients in seasonal precipitation across wheat growing areas over a small country such as Tunisia, a grid pattern of 29 × 29 km was established as a basis for the geospatial simulation. Surprisingly, the simulation reflected opposite strategies in terms of water use (water-saving vs aggressive water use). The highest yield gain (30%) resulting from water-saving modification was found to occur in the food-insecure region of Sidi Bouzid. Traits enabling aggressive water use were found to be generally favorable across Tunisia, with one trait leading to up to 80% and 40% increases in yield and its stability in the food-challenged south of the country. However, major yield penalties were found to occur if water-saving traits were to be deployed in the ‘wrong’ region. Those findings could be used as a blueprint to navigate complex trait × environment interactions and to better inform local breeding and management programs to improve wheat yield and it stability in Tunisia and the MENA region in general

    INVESTIGATION OF PUEA IN COGNITIVE RADIO NETWORKS USING ENERGY DETECTION IN DIFFERENT CHANNEL MODEL

    No full text
    Primary User Emulation Attack (PUEA) is one of the major threats to the spectrum sensing in cognitive radio networks. This paper studies the PUEA using energy detection that is based on the energy of the received signal. It discusses the impact of increasing the number of attackers on the performance of secondary user. Moreover, studying how the malicious user can emulate the Primary User (PU) signal is made. This is the first analytical method to study PUEA under a different number of attackers. The detection of the PUEA increases with increasing the number of attackers and decreases when changing the channel from log normal to Rayleigh fading

    SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams

    No full text
    This paper presents the scalable on-line execution (SOLE) algorithm for continuous and on-line evaluation of concurrent continuous spatio-temporal queries over data streams. Incoming spatio-temporal data streams are processed in-memory against a set of outstanding continuous queries. The SOLE algorithm utilizes the scarce memory resource efficiently by keeping track of only the significant objects. In-memory stored objects are expired (i.e., dropped) from memory once they become insignificant. SOLE is a scalable algorithm where all the continuous outstanding queries share the same buffer pool. In addition, SOLE is presented as a spatio-temporal join between two input streams, a stream of spatio-temporal objects and a stream of spatio-temporal queries. To cope with intervals of high arrival rates of objects and/or queries, SOLE utilizes a load-shedding approach where some of the stored objects are dropped from memory. SOLE is implemented as a pipelined query operator that can be combined with traditional query operators in a query execution plan to support a wide variety of continuous queries. Performance experiments based on a real implementation of SOLE inside a prototype of a data stream management system show the scalability and efficiency of SOLE in highly dynamic environments
    corecore